Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Cross-domain sentiment classification method of convolution-bi-directional long short-term memory based on attention mechanism
GONG Qin, LEI Man, WANG Jichao, WANG Baoqun
Journal of Computer Applications    2019, 39 (8): 2186-2191.   DOI: 10.11772/j.issn.1001-9081.2019010096
Abstract706)      PDF (873KB)(531)       Save
Concerning the problems that the text representation features in the existing cross-domain sentiment classification method ignore the sentiment information of important words and there is negative transfer during transfer process, a Convolution-Bi-directional Long Short-Term Memory based on Attention mechanism (AC-BiLSTM) model was proposed to realize knowledge transfer. Firstly, the vector representation of text was obtained by low-dimensional dense word vectors. Secondly, after local context features being obtained by convolution operation, the long dependence relationship between the features was fully considered by Bi-directional Long Short-Term Memory (BiLSTM) network. Then, the contribution degrees of different words to the text were considered by introducing attention mechanism, and a regular term constraint was introduced into the objective function in order to avoid the negative transfer phenomenon in transfer process. Finally, the model parameters trained on source domain product reviews were transferred to target domain product reviews, and the labeled data in a small number of target domains were fine-tuned. Experimental results show that compared with AE-SCL-SR (AutoEncoder Structural Correspondence Learning with Similarity Regularization) method and Adversarial Memory Network (AMN) method, AC-BiLSTM method has average accuracy increased by 6.5% and 2.2% respectively, which demonstrates that AC-BiLSTM method can effectively improve cross-domain sentiment classification performance.
Reference | Related Articles | Metrics
Collaborative filtering recommendation algorithm based on tag weight
LEI Man, GONG Qin, WANG Jichao, WANG Baoqun
Journal of Computer Applications    2019, 39 (3): 634-638.   DOI: 10.11772/j.issn.1001-9081.2018071521
Abstract1737)      PDF (830KB)(518)       Save
Aiming at the problem that the recommendation accuracy is not good enough due to the similarity calculation in traditional collaborative filtering recommendation algorithm, a collaborative filtering recommendation algorithm based on the similarity measurement method of tag weight was proposed. Firstly, the calculation of tag weights in existing algorithm was improved to construct a user-tag weight matrix and an item-tag weight matrix. Secondly, as the recommendation system is based on the user-centered recommendation, the most accurate evaluation and demand of the users were obtained by constructing a user-item association matrix. Finally, according to the user-item bipartite graph, the similarity between users based on the label weight was calculated by the material diffusion algorithm, and the recommendation lists were generated for the target users. The experimental results show that compared with UITGCF (a hybrid Collaborative Filtering recommendation algorithm by combining the diffusion on User-Item-Tag Graph and users' personal interest model), when the sparsity environment is 0.1, the recall, accuracy, F1 score of the proposed algorithm were respectively increased by 14.69%, 9.44% and 17.23%. When the recommendation item number is 10, the three indicators respectively were increased by 17.99%, 8.98%, and 16.27%. The results show that the collaborative filtering recommendation algorithm based on tag weight effectively improves the recommendation results.
Reference | Related Articles | Metrics
Multi-label classification algorithm based on gravitational model
LI Zhaoyu, WANG Jichao, LEI Man, GONG Qin
Journal of Computer Applications    2018, 38 (10): 2807-2811.   DOI: 10.11772/j.issn.1001-9081.2018040813
Abstract778)      PDF (864KB)(396)       Save
Aiming at the problem that multi-label classification algorithms cannot fully utilize the correlation between labels, a new multi-label classification algorithm based on gravitational model namely MLBGM was proposed, by establishing the positive and negative correlation matrices of labels to mine different correlations among labeled. Firstly, by traversing all samples in the training set, k nearest neighbors for each training sample were obtain. Secondly, according to the distribution of labels in all neighbors of each sample, positive and negative correlation matrices were established for each training sample. Then, the neighbor density and neighbor weights for each training sample were calculated. Finally, a multi-label classification model was constructed by calculating the interaction between data particles. The experimental results show that the HammingLoss of MLBGM is reduced by an average of 15.62% compared with 5 contrast algorithms that do not consider negative correlation between labels; on the MicroF1, the average increase is 7.12%; on the SubsetAccuracy, the average increase is 14.88%. MLBGM obtains effective experimental results and outperforms comparison algorithms as it makes full use of the different correlations between labels.
Reference | Related Articles | Metrics